A fast VLSI systolic array for large modulus residue addition

نویسندگان

  • Subir Bandyopadhyay
  • Graham A. Jullien
  • Abhijit Sengupta
چکیده

The Residue number system (RNS) is inherently suited to high speed computations using custom tailored VLSI systems. In this paper, an algorithm for residue addition, based on a novel, 'non unique' number representation scheme, is implemented by a systolic array embedded in a VLSI chip. The pipelined cells are implemented, using a true single phase clock dynamic circuit structure, with computer synthesized minimized trees (switching trees). The array may be easily programmed by the user to accept any arbitrary modulus. Important applications of this array are in residue decoding and fault tolerant computation requiring the use of the Chinese Remainder Theorem where the modulus for addition is relatively large.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High-speed signal processing using systolic arrays over finite rings

This paper presents a simple, modular, architecture for very fast digital signal processing elements. The computation is performed over finite rings (or fields) and is able to emulate processing over the integer ring using residue number systems. The computations are restricted to closed operations (ring or field binary operators) with the ability to perform limited scaling operations. Computat...

متن کامل

A Systolic Architecture for Modulo Multiplication

With the current advances in VLSI technology, traditional algorithms for Residue Number System (RNS) based architectures should be reevaluated to explore the new technology dimensions. In this brief, we introduce A @(log n ) algorithm for large moduli multiplication for RNS based architectures. A systolic array has been designed to perform the modulo multiplication Algorithm. The proposed modul...

متن کامل

Homogeneous VLSI structures for high speed digital signal processing using number theoretic techniques

Exact computations, performed with residues, occur in Number Theoretic Transforms and Residue Number System implementations. Once thought awkward to implement with standard logic circuits, the application of efficient small lookup tables, constructed with pipelined dynamic ROM's, allows very efficient construction of hardware ideally suited to residue operations. Linear DSP operations that are ...

متن کامل

A Uni ed Systolic Array for Fast Computation of the DCT/DST/DHT

This paper proposes a two-dimensional (2-D) VLSI architecture using a uni ed systolic array for fast computation of the discrete cosine transform/discrete sine transform/discrete Hartley transform (DCT/DST/DHT). The N -point discrete transform is decomposed into evenand oddnumbered frequency samples and they are computed independently at the same time. The proposed uni ed systolic array archite...

متن کامل

A comparison of block-matching algorithms mapped to systolic-array implementation

This paper presents an evaluation of several wellknown block-matching motion estimation algorithms from a system-level very large scale integration (VLSI) design viewpoint. Because a straightforward block-matching algorithm (BMA) demands a very large amount of computing power, many fast algorithms have been developed. However, these fast algorithms are often designed to merely reduce arithmetic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • VLSI Signal Processing

دوره 8  شماره 

صفحات  -

تاریخ انتشار 1994